Prime Slaughter: Playful Prime Numbers
نویسندگان
چکیده
Starting from the difficulty of creating playful representation of domain-specific abstract concepts, this study discusses the design of Prime Slaughter, a computer game aimed at facilitating individual sense-making of abstract mathematical concepts. Specifically the game proposes a transpositionmathematical concepts. Specifically the game proposes a transposition of primality and factorization into playful interactions, addressed to primary and early secondary school children. Taking into account individual needs expressed by children regarding play, during a participatory design processes aimed at enhancing learning in museums, Prime Slaughter allows for multiple forms of play and their integration. A simple working prototype has already been developed; it will be tested and re-designed through participatory workshops, involving a group of children in our target group.
منابع مشابه
Gene flow in a national cross-breeding beef population.
Future progress in genetic improvement and the monitoring of genetic resources in beef cattle requires a detailed understanding of the population under selection. This study examines the gene flow in the UK beef population with an uncommon breeding structure involving interaction between the beef and dairy populations. British Cattle Movement Service records were used as the primary source of i...
متن کاملPredicting Prime Numbers Using Cartesian Genetic Programming
Prime generating polynomial functions are known that can produce sequences of prime numbers (e.g. Euler polynomials). However, polynomials which produce consecutive prime numbers are much more difficult to obtain. In this paper, we propose approaches for both these problems. The first uses Cartesian Genetic Programming (CGP) to directly evolve integer based prime-prediction mathematical formula...
متن کاملProperties of Primes and Multiplicative Group of a Field
In the [16] has been proven that the multiplicative group Z/pZ∗ is a cyclic group. Likewise, finite subgroup of the multiplicative group of a field is a cyclic group. However, finite subgroup of the multiplicative group of a field being a cyclic group has not yet been proven. Therefore, it is of importance to prove that finite subgroup of the multiplicative group of a field is a cyclic group. M...
متن کاملThe Prime Number Formulas
There are many proposed partial prime number formulas, however, no formula can generate all prime numbers. Here we show three formulas which can obtain the entire prime numbers set from the positive integers, based on the Möbius function plus the “omega” function, or the Omega function, or the divisor function. The history of searching for a prime number formula goes back to the ancient Egyptia...
متن کاملThe Set of Prime Numbers *
In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime candidates are obtained in terms of the first perfect number. The asymptotic behaviour is also considered. We obtain for the first time an explicit relation for g...
متن کامل